An Improved Antenna Array Pattern Synthesis Method Using Fast Fourier Transforms
نویسندگان
چکیده
منابع مشابه
A Pattern Synthesis Method for Large Planar Antenna Array
The pattern synthesis for large antenna arrays is very important because of its wide applications. Several antenna array synthesis techniques for planar antenna array have been developed in the past years. In this paper, a hybrid method for solving antenna array pattern synthesis problem is introduced. The proposed method has three steps. Firstly, the iterative fast Fourier transforms (IFT) is ...
متن کاملPattern Synthesis for Arbitrary Arrays Using an Adaptive Array Method
This paper presents a new pattern synthesis algorithm for arbitrary arrays based on adaptive array theory. With this algorithm, the designer can efficiently control both mainlobe shaping and sidelobe levels. The element weights optimize a weighted L2 norm between desired and achieved patterns. The values of the weighting function in the L2 norm, interpreted as imaginary jammers as in Olen and C...
متن کاملAntenna array pattern synthesis via convex optimization
We show that a variety of antenna array pattern synthesis problems can be expressed as convex optimization problems, which can be (numerically) solved with great eeciency by recently developed interior-point methods. The synthesis problems involve arrays with arbitrary geometry and element directivity, constraints on far and near eld patterns over narrow or broad frequency bandwidth, and some i...
متن کاملFast Fourier Transforms
29 O(b log(b)) operations (using standard multiplication). As there are O(b= log(b)) primes in total, the running time of this stage of the algorithm is O(b 2 L), even using the \grammar school" method of integer multiplication. At this stage of the algorithm we have obtained a vector of length L whose entries are integral linear combinations of powers of with coeecients bounded by M in absolut...
متن کاملDimensionless Fast Fourier Transforms
This paper shows that there are fast Fourier transform (FFT) algorithms that work, for a fixed number of points, independent of the dimension. Changing the dimension is achieved by relabeling the input and the output and changing the “twiddle factors.” An important consequence of this result, is that a program designed to compute the 1-dimensional Fourier transform can be easily modified to com...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Antennas and Propagation
سال: 2015
ISSN: 1687-5869,1687-5877
DOI: 10.1155/2015/316962